Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems
نویسندگان
چکیده
منابع مشابه
Solving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملDerleme Makalesi MULTI OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEMS
Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to serve the desired purpose. Multi-objective fle...
متن کاملSingle Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...
متن کاملA Multi-swarm Approach to Multi-objective Flexible Job-shop Scheduling Problems
Swarm Intelligence (SI) is an innovative distributed intelligent paradigm whereby the collective behaviors of unsophisticated individuals interacting locally with their environment cause coherent functional global patterns to emerge. In this paper, we model the scheduling problem for the multi-objective Flexible Job-shop Scheduling Problems (FJSP) and attempt to formulate and solve the problem ...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2015
ISSN: 0020-0255
DOI: 10.1016/j.ins.2014.11.036